A Parallel Backprojection Algorithm for Spiral Cone-Beam CT Exact Reconstruction
نویسندگان
چکیده
On reconstructing a volume, the exact reconstruction algorithm for spiral cone-beam CT accesses the memory many times while all the filtered projection data has to be arrived. This is quite a bottleneck for implementation. Normally, the filtered projection data is transferred frame by frame in serial. In this paper, a new backprojection algorithm is proposed. The algorithm uses data inside the Tam-Danielsson window and slightly more. When one filtered projection pixel data arrives, certain interpolation algorithm is used on the data and the dedicated volume is decided by the coordinate of the pixel data. Then the dedicated volume is updated by the interpolated data. The procedure repeats when the next filtered backprojection arrives. If the transfer rate is slow enough, then the real-time backprojection can be achieved. Experiment results are given. It can been seen that the image quality is satisfactory and the artifact is greatly refined.
منابع مشابه
Katsevich-Type Algorithms for Variable Radius Spiral Cone-Beam CT
To solve the long object problem, an exact and efficient algorithm has been recently developed by Katsevich. While the Katsevich algorithm only works with standard helical cone-beam scanning, there is an important need for nonstandard spiral cone-beam scanning. Specifically, we need a scanning spiral of variable radius for our newly proposed electron-beam CT/micro-CT prototype. In this paper, f...
متن کاملAdvanced single-slice rebinning in cone-beam spiral CT: Theoretical considerations and medical applications
The advanced single–slice rebinning algorithm (ASSR) is a highly accurate and efficient approximative algorithm for cone–beam spiral CT that a) yields high image quality even at large cone angles, b) makes use of available 2D backprojection algorithms/hardware and c) allows for sequential data processing. It uses virtual R–planes (reconstruction planes) that are tilted to optimally fit 180 spir...
متن کاملOn-the-fly-Reconstruction in Exact Cone-Beam CT using the Cell Broadband Engine Architecture
In medical imaging a high image quality is required. Exact cone-beam reconstruction algorithms, e.g. the Mline method, provide excellent image quality without any cone artifacts. Although the M-line approach is still of a filtered backprojection style, it has an increased computational complexity as it requires additional computations for the filtering of the projection images, e.g. derivative ...
متن کاملExact Interior Reconstruction with Cone-Beam CT
Using the backprojection filtration (BPF) and filtered backprojection (FBP) approaches, respectively, we prove that with cone-beam CT the interior problem can be exactly solved by analytic continuation. The prior knowledge we assume is that a volume of interest (VOI) in an object to be reconstructed is known in a subregion of the VOI. Our derivations are based on the so-called generalized PI-se...
متن کاملParallel Implementation of Katsevich's FBP Algorithm
For spiral cone-beam CT, parallel computing is an effective approach to resolving the problem of heavy computation burden. It is well known that the major computation time is spent in the backprojection step for either filtered-backprojection (FBP) or backprojected-filtration (BPF) algorithms. By the cone-beam cover method [1], the backprojection procedure is driven by cone-beam projections, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JDCTA
دوره 4 شماره
صفحات -
تاریخ انتشار 2010